Utilization Bound Re-visited
نویسندگان
چکیده
Utilization bound is a well-known concept introduced in the seminal paper of Liu and Layland, which provides a simple and practical way to test the schedulability of a real-time task set. The original utilization bound for the fixed-priority scheduler was given as a function of the number of tasks in the periodic task set. In this paper, we define the utilization bound as a function of the information about the task set. By making use of more than just the number of tasks, better utilization bound over the Liu and Layland bound can be achieved. We investigate in particular the bound given a set of periods for which it is still unknown if there is a polynomial algorithm for the exact bound. By investigating the relationships among the periods, we derive algorithms that yield better bounds than the Liu and Layland bound and the harmonic chain bound. Randomly generated task sets are tested against different bound algorithms. We also give a more intuitive proof of the harmonic chain bound and derive a computationally simpler algorithm.
منابع مشابه
The Ecology of Gynecological Care for Women
Gynecological care is vital to women's health but utilization of gynecological care has been seldom addressed. We applied the population-based "ecology model" to demonstrate the utilization of gynecological care of women, with examples from Taiwan. We analyzed the claims data from the cohort datasets within the National Health Insurance Research Database in Taiwan. Women's utilization of gyneco...
متن کاملModeling of a Probabilistic Re-Entrant Line Bounded by Limited Operation Utilization Time
This paper presents an analytical model based on mean value analysis (MVA) technique for a probabilistic re-entrant line. The objective is to develop a solution method to determine the total cycle time of a Reflow Screening (RS) operation in a semiconductor assembly plant. The uniqueness of this operation is that it has to be borrowed from another department in order to perform the production s...
متن کاملAverage Case Complexity of Branch-and-Bound Algorithms on Random b-ary Trees
Proof. Lets assume that there are two nodes u and v in depth d for which the calculated lower bound is optimal, and u is visited first among all nodes in depth d with optimal lower bound. This implies that the lower bound of v is not smaller than the lower bound of u. A best-first search Branch-and-Bound algorithm only visits nodes with lower bounds not greater than the global minimum. It follo...
متن کاملDental Services and Attitudes towards Its Regular Utilization among Civil Servants in Ibadan, Nigeria
BACKGROUND Regular utilization of dental services is key to the attainment of optimal oral health state, an integral component of general health and well being needed for effective productivity by working personnel. OBJECTIVE This study assessed the rate and pattern of dental service utilization among civil servants and their attitudes towards its regular use. METHODOLOGY A multi-stage samp...
متن کاملMultiple access wiretap channel with noiseless feedback
The physical layer security in the up-link of the wireless communication systems is often modeled as the multiple access wiretap channel (MAC-WT), and recently it has received a lot attention. In this paper, the MAC-WT has been re-visited by considering the situation that the legitimate receiver feeds his received channel output back to the transmitters via two noiseless channels, respectively....
متن کامل